A compiled implementation of normalisation by evaluation
نویسندگان
چکیده
We present a novel compiled approach to Normalisation by Evaluation (NBE) for ML-like languages. It supports efficient normalisation of open λ-terms with respect to β-reduction and rewrite rules. We have implemented NBE and show both a detailed formal model of our implementation and its verification in Isabelle. Finally we discuss how NBE is turned into a proof rule in Isabelle.
منابع مشابه
A Compiled Implementation of Normalization by Evaluation
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrite rules. We have implemented NBE and show both a detailed formal model of our implementation and its verification in Isabelle. Finally we discuss how NBE is turned into a proof rule in Isabelle.
متن کاملNormalization by Evaluation
This article formalizes normalization by evaluation as implemented in Isabelle. Lambda calculus plus term rewriting is compiled into a functional program with pattern matching. It is proved that the result of a successful evaluation is a) correct, i.e. equivalent to the input, and b) in normal form. An earlier version of this theory is described in a paper by Aehlig et al. [1]. The normal form ...
متن کاملAccumulating bindings
We give a Haskell implementation of Filinski’s normalisation by evaluation algorithm for the computational lambda-calculus with sums. Taking advantage of extensions to the GHC compiler, our implementation represents object language types as Haskell types and ensures that type errors are detected statically. Following Filinski, the implementation is parameterised over a residualising monad. The ...
متن کاملOperational aspects of untyped Normalisation by Evaluation
A purely syntactic and untyped variant of Normalization by Evaluation for the -calculus is presented in the framework of a two-level -calculus with rewrite rules to model the inverse of the evaluation functional. Among its operational properties gures a standardization theorem that formally establishes adequacy of implementation in functional programming languages. An example implementation in ...
متن کاملAn implementation and evaluation of an on-line speaker verification system for field trials
This paper presents a HMM-based speaker verification system which was implemented for a field trial. One of the challenges for moving HMM from speech recognition to speaker verification is to understand the HMM score variation and to define a proper measurement which is comparable across speech samples. In this paper we define two basic verification measurements, a qualifier-based measurement a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Funct. Program.
دوره 22 شماره
صفحات -
تاریخ انتشار 2012